An Approximate, Efficient Solver for LP Rounding
نویسندگان
چکیده
The vertex cover problem Find a set of vertices that cover the graph LP rounding is a 4 step scheme to approximate combinatorial problems with theoretical guarantees on solution quality. Several problems in machine learning, computer vision and data analysis can be formulated using NP-‐hard combinatorial optimization problems. In many of these applications, approximate solutions for these NP-‐hard problems are 'good enough'.
منابع مشابه
Approximation Algorithms for the Single-Warehouse Multi-Retailer Problem With Piecewise Linear Cost Structures1
Recently, Chan et al. (2000) proposed an efficient heuristic for a class of finite time planning horizon single-warehouse multi-retailer system with complex (nonlinear) transportation cost structures. Their heuristic is based on solving a large LP relaxation of the underlying problem. In this paper, we analyze the strength of the proposed LP relaxation and show that it attains the best theoreti...
متن کاملImproved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex model. For this problem, we propose an improved st-MINCUT based move making algorithm. Unlike previous move making approaches, which either provide a loose bound or no bound on the quality of the solution (in terms of the...
متن کاملLecturer : Debmalya Panigrahi Scribe :
Recall that many combinatorial problems of interest can be encoded as integer linear programs. Solving integer linear programs is in general NP-hard, so we nearly always relax the integrality requirement into a linear constraint like nonnegativity during our analysis. Our previous algorithms for solving these problems never solved the relaxed program explicitly (e.g. using simplex). In LP round...
متن کاملMESSAGE-PASSING FOR GRAPH-STRUCTURED LINEAR PROGRAMS Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tree-based” linear programming (LP) relaxations for the MAP problem. This paper develops a family of super-linearly convergent algorithms for solving these LPs, based on proximal minimization schemes using Bregman divergence...
متن کاملHierarchical Planar Correlation Clustering for Cell Segmentation
We introduce a novel algorithm for hierarchical clustering on planar graphs we call “Hierarchical Greedy Planar Correlation Clustering” (HGPCC). We formulate hierarchical image segmentation as an ultrametric rounding problem on a superpixel graph where there are edges between superpixels that are adjacent in the image. We apply coordinate descent optimization where updates are based on planar c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1311.2661 شماره
صفحات -
تاریخ انتشار 2012